computing ga4 index of some graph operations

Authors

m. saheli

m. jalali rad

abstract

the geometric-arithmetic index is another topological index was defined as2 deg ( )deg ( )( )deg ( ) deg ( )g guv eg gu vga gu v  , in which degree of vertex u denoted by degg (u). wenow define a new version of ga index as 4( )2 ε ( )ε ( )( )ε ( ) ε ( )g ge uv e g g gu vga g  u v , where εg(u) isthe eccentricity of vertex u. in this paper we compute this new topological index for twograph operations.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Computing GA4 Index of Some Graph Operations

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

full text

Index of Some Graph Operations

Let G = (V, E) be a graph. For e = uv ∈ E(G), nu(e) is the number of vertices of G lying closer to u than to v and nv(e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as ∑ uv∈E(G) 2 √ nu(e)nv(e) nu(e)+nv(e) . We explore here some mathematical properties and present explicit formulas for this new index under several graph operations.

full text

The Generalized Wiener Polarity Index of some Graph Operations

Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.

full text

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

full text

The Hyper-Zagreb Index of Graph Operations

Let G be a simple connected graph. The first and second Zagreb indices have been introduced as  vV(G) (v)2 M1(G) degG and M2(G)  uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G)     (degG(u)  degG In this paper, the HyperZagreb index of the Cartesian p...

full text

Reformulated F-index of graph operations

The first general Zagreb index is defined as $M_1^lambda(G)=sum_{vin V(G)}d_{G}(v)^lambda$. The case $lambda=3$, is called F-index. Similarly, reformulated first general Zagreb index is defined in terms of edge-drees as $EM_1^lambda(G)=sum_{ein E(G)}d_{G}(e)^lambda$ and the reformulated F-index is $RF(G)=sum_{ein E(G)}d_{G}(e)^3$. In this paper, we compute the reformulated F-index for some grap...

full text

My Resources

Save resource for easier access later


Journal title:
iranian journal of mathematical chemistry

Publisher: university of kashan

ISSN 2228-6489

volume 3

issue Supplement 1 2012

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023